Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition
نویسنده
چکیده
This paper shows that linear time μ-calculus with sequential composition defines exactly those properties that are expressible with alternating context-free grammars for ω-words. This helps to understand the expressive power of modal μ-calculus with a chop operator and provides a logical characterisation of the class of alternating context-free languages.
منابع مشابه
The Expressive Power of Epistemic $\mu$-Calculus
While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...
متن کاملA connection between concurrency and language theory
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory ...
متن کاملModel Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, that decides the full modal mu-calculus. Whereas the actual model checking algorithm results from considering conditional semantics together with backtracking caused by alternation, the corresponding correctness proof req...
متن کاملLinear Context-Free Languages Are in NC
This paper concerns linear context-free languages (LIN). We prove that LIN ⊆ NC (under UE∗−uniformity reduction). We introduce a new normal form for context-free grammars, called Dyck normal form. Using this new normal form we prove that for each context-free language L there exist an integer K and a homomorphism φ such that L = φ(D′ K), where D′ K ⊆ DK , and DK is the one-sided Dyck language o...
متن کاملAlmost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages
Sublinear time almost optimal algorithms for the recognition problem for three basic sub-classes of context-free languages (unambiguous, deterministic and linear) are presented. Optimality is measured with respect to the work of the best known sequential algorithm for a given problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 68 شماره
صفحات -
تاریخ انتشار 2002